Polynomial Interpolation of Minimal Degree and Grr Obner Bases
نویسنده
چکیده
This paper investigates polynomial interpolation with respect to a nite set of appropriate linear functionals and the close relations to the Grr obner basis of the associated nite dimensional ideal.
منابع مشابه
Xideal Grr Obner Bases for Exterior Algebra
1 Description The method of Grr obner bases in commutative polynomial rings introduced by Buchberger (e.g. 1]) is a well-known and very important tool in polynomial ideal theory, for example in solving the ideal membership problem. XIDEAL extends the method to exterior algebras using algorithms from 2]. There are two main departures from the commutative polynomial case. First, owing to the non-...
متن کاملGrr Obner Bases for Polynomial Ideals over Commutative Noetherian Rings and Related Results ?
We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...
متن کاملComputing Grr Obner Bases by Fglm Techniques in a Noncommutative Setting
A generalization of the FGLM technique is given to compute Grr obner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are discussed in order to compute G-bases on (twisted) semigroup rings. It is well known that the co...
متن کاملPolynomial Ideals for Sandpiles and Their Grr Obner Bases Polynomial Ideals for Sandpiles and Their Grr Obner Bases Polynomial Ideals for Sandpiles and Their Grr Obner Bases ?
A polynomial ideal encoding topplings in the abelian sandpile model on a graph is introduced. A Grr obner basis of this ideal is interpreted combinatorially in terms of well-connected subgraphs. This gives rise to algorithms to determine the identity and the operation in the group of recurrent conngurations. Tas de sable, id eaux polynomiaux et leurs bases de Grr obner R esum e : Nous introduis...
متن کامل1 HOW TO USE GR OBNER - MATHEMATICA 2 Global Variable Semantics Possible Values
In this paper we report on GR OBNER-Mathematica, an experimental implementation for computing Grr obner bases in Mathematica. This implementation in its current form ooers three diierent versions of the Grr obner bases algorithm and is generic with respect to the ordering of power products, the domain of coeecients of the polynomials, and the representation of power products, monomials, polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998